Fast algorithms for discrete polynomial transforms
نویسندگان
چکیده
منابع مشابه
Fast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk , then P coincides with CN+1 := (cos jkπ N )j,k=0. This paper presents a new fast algorithm for the computation of the matrixvector product Pa in O(N logN) arithmetical operations. The algorithm divides into a fast transform wh...
متن کاملA Polynomial Approach to Fast Algorithms for Discrete Fourier-cosine and Fourier-sine Transforms
The discrete Fourier-cosine transform (cos-DFT), the discrete Fourier-sine transform (sin-DFT) and the discrete cosine transform (DCT) are closely related to the discrete Fourier transform (DFT) of real-valued sequences. This paper describes a general method for constructing fast algorithms for the cos-DFT, the sin-DFT and the DCT, which is based on polynomial arithmetic with Chebyshev polynomi...
متن کاملFast algorithms for discrete and continuous wavelet transforms
Several algorithms are reviewed for computing various types of wavelet transforms: the Mallat algorithm, the “a trous” algorithm and their generalizations by Shensa. The goal is 1) to develop guidelines for implementing discrete and continuous wavelet transforms efficiently, 2) to compare the various algorithms obtained and give an idea of possible gains by providing operation counts. The compu...
متن کاملFast and stable algorithms for discrete spherical Fourier transforms
In this paper, we propose an algorithm for the stable and eecient computation of Fourier expansions of square integrable functions on the unit sphere S R 3 , as well as for the evaluation of these Fourier expansions at special knots. The heart of the algorithm is an eecient realization of discrete Legendre function transforms based on a modiied and stabilized version of the Driscoll{Healy algor...
متن کاملFast Discrete Curvelet Transforms
This paper describes two digital implementations of a new mathematical transform, namely, the second generation curvelet transform [12, 10] in two and three dimensions. The first digital transformation is based on unequally-spaced fast Fourier transforms (USFFT) while the second is based on the wrapping of specially selected Fourier samples. The two implementations essentially differ by the cho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1998
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-98-00975-2